package cn.wolfcode.luowowo.article.query.condition;

import java.util.HashMap;
import java.util.Map;

public class TravelCondition {

    public static Map<Integer,TravelCondition> travelTimeRange=new HashMap<>();
    public static Map<Integer,TravelCondition> perExpendRange=new HashMap<>();
    public static Map<Integer,TravelCondition> dayRange=new HashMap<>();

    static {
        travelTimeRange.put(1, new TravelCondition(1,2));
        travelTimeRange.put(2, new TravelCondition(3,4));
        travelTimeRange.put(3, new TravelCondition(5,6));
        travelTimeRange.put(4, new TravelCondition(7,8));
        travelTimeRange.put(5, new TravelCondition(9,10));
        travelTimeRange.put(6, new TravelCondition(11,12));

        perExpendRange.put(1,new TravelCondition(1,999));
        perExpendRange.put(2,new TravelCondition(1000,6000));
        perExpendRange.put(3,new TravelCondition(6000,20000));
        perExpendRange.put(4,new TravelCondition(20000,Integer.MAX_VALUE));

        dayRange.put(1,new TravelCondition(0,3));
        dayRange.put(2,new TravelCondition(4,7));
        dayRange.put(3,new TravelCondition(8,14));
        dayRange.put(4,new TravelCondition(15,Integer.MAX_VALUE));
    }

    private Integer min;
    private Integer max;

    public TravelCondition(Integer min,Integer max) {
        this.min=min;
        this.max=max;
    }
}
